Super-visible codes

Super-resolution of bar codes

This paper describes how under-resolved images of bar codes may be read by suitable processing. A two-dimensional image of a bar code with insufficient resolution to be able to resolve the individual bars is processed to give a high-resolution image. For this to work, the bar code (or camera) must be slightly rotated to give a fraction of a pixel offset between rows. Since the bars are straight...

Super-quasi-orthogonal space-time trellis codes

We introduce a new family of Space-Time Trellis Codes which extends the powerful characteristics of SuperOrthogonal Space-Time Trellis Codes to four transmit antennas. We consider a family of quasi-orthogonal space-time block codes as building blocks in our new trellis codes. These codes combine set-partitioning and a super set of quasi-orthogonal space-time block codes in a systematic way to p...

Super-orthogonal space-time trellis codes

We introduce a new class of space-time codes called super-orthogonal space-time trellis codes. These codes combine set partitioning and a super set of orthogonal space–time block codes in a systematic way to provide full diversity and improved coding gain over earlier space–time trellis code constructions. We also study the optimality of our set partitioning and provide coding gain analysis. Co...

The Super-Trellis Structure of Turbo Codes

The super-trellis structure of turbo codes

In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we ca...